Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem
نویسندگان
چکیده
منابع مشابه
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuristic approaches addressing this problem, whereas fast construction heuristics are primarily based on Prim’s minimum spanning tree algorithm and fail to produce reasonable solutions in particular on large Euclidean ins...
متن کاملFast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Given a connected, undirected graph G = (V, E) on n = |V | vertices, an integer bound D ≥ 2 and non-zero edge weights associated with each edge e ∈ E, a bounded diameter minimum spanning tree (BDMST) on G is defined as a spanning tree T⊆ E on G of minimum edge cost w(T) =∑w(e), ∀ e∈ T and tree diameter no greater than D. The Euclidean BDMST Problem aims to find the minimum cost BDMST on graphs ...
متن کاملExact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem
The bounded diameter minimum spanning tree (BDMST) problem is a combinatorial optimization problem appearing in applications such as wire-based communication network design when quality of service is of major concern and, for example, a signal between any two nodes in the network should not pass more than a fixed number of routers. It also arises in ad-hoc wireless networks and in the areas of ...
متن کامل(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump inequalities by a Branch&Cut algorithm. As the separation subproblem of identifying currently violated jump inequalities is difficult, we...
متن کامل(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump inequalities by a Branch&Cut algorithm. As the separation subproblem of identifying currently violated jump inequalities is difficult, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008